Leadership games with convex strategy sets

نویسندگان

  • Bernhard von Stengel
  • Shmuel Zamir
چکیده

A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, including nongeneric games. The main result is that leadership is advantageous in the sense that, as a set, the leader’s payoffs in equilibrium are at least as high as his Nash and correlated equilibrium payoffs in the simultaneous game. We also consider leadership games with three or more players, where most conclusions no longer hold.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approachability in Stackelberg Stochastic Games with Vector Costs

The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optim...

متن کامل

On the evolutionary selection of sets of Nash equilibria

It is well established for evolutionary dynamics in asymmetric games that a pure strategy combination is asymptotically stable if and only if it is a strict Nash equilibrium. We use an extension of the notion of a strict Nash equilibrium to sets of strategy combinations called ‘strict equilibrium set’ and show the following. For a large class of evolutionary dynamics, including all monotone reg...

متن کامل

A Learning Scheme for Approachability in MDPs and Stackelberg Stochastic Games

The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optim...

متن کامل

A Learning Scheme for Blackwell’s Approachability in MDPs and Stackelberg Stochastic Games

The notion of approachability was introduced by Blackwell ([8]) in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector-cost of a given player towards a given target set, irrespective of the strategies of the other players. In this paper, motivated from the multi-objective...

متن کامل

Learning correlated equilibria in games with compact sets of strategies

Hart and Schmeidler’s extension of correlated equilibrium to games with infinite sets of strategies is studied. General properties of the set of correlated equilibria are described. It is shown that, just like for finite games, if all players play according to an appropriate regret-minimizing strategy then the empirical frequencies of play converge to the set of correlated equilibria whenever t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2010